Acceleration strategies for the weight constrained shortest path problem with replenishment
نویسندگان
چکیده
منابع مشابه
The weight-constrained shortest path problem
In this class project, we investigate certain aspects of the Weight Constrained Shortest Path Problem. The problem is known NP-Hard, but there are algorithms, both exact and approximate, that attempt to solve it. We analyze two of the important exact methods label setting on graphs and Lagrangean relaxation of the constraint, and evaluate how they perform with different graph sizes, and differe...
متن کاملAcceleration of Shortest Path and Constrained Shortest Path Computation
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...
متن کاملMemory-Constrained Algorithms for Shortest Path Problem
We present an algorithm computing a shortest path between to vertices in a square grid graph with edge weights that uses memory less than linear in the number of vertices (apart from that for storing in the input). For any ε > 0, our algorithm uses a work space of O(n) words and runs in O(n) time.
متن کاملShorter Path Constraints for the Resource Constrained Shortest Path Problem
Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constraint filtering have been studied. We provide the first extensive experimental evaluation of the new algorithms in the context of the resource constrained shortest path problem. We show how reasoning about path-substructures in comb...
متن کاملSimultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
Conventional Lagrangean preprocessing for the network Weight Constrained Shortest Path Problem (WCSPP), for example Beasley and Christofides [3], calculates lower bounds on the cost of using each node and edge in a feasible path using a single optimal Lagrange multiplier for the relaxation of the WCSPP. These lower bounds are used in conjunction with an upper bound to eliminate nodes and edges....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2014
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-014-0742-x